Odd cyclic surface separators in planar graphs
نویسندگان
چکیده
Given a plane graph G and two vertices s and t in G, an s-t surface separator is a closed curve C such that s belongs to the other region of R \C than t. A cycle C is called a cyclic surface separator if C is an s-t surface separator, and an odd cyclic surface separator if C is an odd cycle. We consider the problem of finding odd cyclic surface separators in planar graphs and show that the problem can be solved in polynomial time.
منابع مشابه
Independent sets in edge-clique graphs II
We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in polynomial time. We show that the independent set problem on edge-clique ...
متن کاملStack and Queue Layouts via Layered Separators
It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not closed under taking minors. For fixed g and k, we show that every n-vertex graph that can be embedded on a surface of genus g with at most k cro...
متن کاملOn classes of graphs with strongly sublinear separators
For real numbers c, ε > 0, let Gc,ε denote the class of graphs G such that each subgraph H of G has a balanced separator of order at most c|V (H)|1−ε. A class G of graphs has strongly sublinear separators if G ⊆ Gc,ε for some c, ε > 0. We investigate properties of such graph classes, leading in particular to an approximate algorithm to determine membership in Gc,ε: there exist c > 0 such that f...
متن کاملalgorithms for parametric minimum spanning tree problems on planar graphs ’
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minimum spanning tree problems on planar graphs and to other families of graphs having small separators.
متن کاملCs 408 Planar Graphs Abhiram Ranade
A graph is planar if it can be drawn in the plane without edges crossing. More formally, a graph is planar if it has an embedding in the plane, in which each vertex is mapped to a distinct point P (v), and edge (u, v) to simple curves connecting P (u), P (v), such that curves intersect only at their endpoints. Examples of planar graphs: Pn, Trees, Cycles, X-tree, K4. Examples of non-planar grap...
متن کامل